Analysis of grid file algorithms
نویسندگان
چکیده
منابع مشابه
File and Memory Security Analysis for Grid Systems
The grid security architecture today does not prevent certain unauthorized access to the files associated with a job executing on a remote machine. Programs and data are transferred to a remote machine for completing staging jobs. Footprints may remain on the machine after the programs and data are deleted from the remote machine. Anyone with super user privileges can access these footprints. I...
متن کاملG Grid File ( and Family )
The Grid File is a multidimensional indexing scheme capable to efficiently index database records in a symmetrical manner, i.e., by avoiding the distinction between primary and secondary keys. The structure is dynamic and adapts gracefully to its contents under insertions and deletions. A single record retrieval costs two disk accesses at most (upper bound), whereas range queries and partial-ma...
متن کاملThe Multilevel Grid File - A Dynamic Hierarchical Multidimensional File Structure
We present a new dynamic hashed file organization that solves most problems associated with the directory of the grid file proposed by Nievergelt et al. Our scheme is a multilevel extension of the grid file that supports multiattribute accesses to the file for exact-match, partialmatch, and range queries as well as graceful expansion and shrinkage of the file in a dynamic environment. This new ...
متن کاملPerformance Analysis of Resource Selection Algorithms in Grid Computing Environment
Problem statement: Metascheduling has become important due to increased number of jobs and resources in the area of grid computing to achieve the objectives of grid users and grid resources. Approach: A variety of factors need to be considered for effective scheduling of resources in such environments such as total time job spend in the grid system, global and local allocation policies and reso...
متن کاملComparative Analysis of Various Grid Based Scheduling Algorithms
Grid computing provides access to heterogeneous resources which are distributed geographically which makes resource scheduling a complex problem. Hence, scheduling algorithms are necessary which allocate jobs to resources by taking into account the requirements of grid environment. The aim of scheduling is to achieve highest possible throughput by matching the need of the application with the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT
سال: 1985
ISSN: 0006-3835,1572-9125
DOI: 10.1007/bf01934379